Tighter bounds on the error probability of fixed convolutional codes
نویسندگان
چکیده
In this paper, we introduce new upper bounds for the bit and burst error probabilities, when a convolutional code is used for transmission over a binary input, additive white Gaussian noise channel, and the decoder performs maximum likelihood decoding. The bounds are tighter than existing bounds, and non-trivial also for signal-to-noise ratios below the computational cutoff rate.
منابع مشابه
Improved closed-form bounds on the performance of convolutional codes with correlated Rayleigh fading
New bounds on the probability of bit error are presented for a coded communication system with binary antipodal modulation and soft-decision maximum-likelihood decoding over a correlated Rayleigh-fading channel. The bounds are closed-form expressions in terms of the code’s transfer function; they are illustrated by considering a system using convolutional encoding. A long-standing conjecture re...
متن کاملOn the weight distribution of terminated convolutional codes
terleaved over L = 3 channel blocks for four different Rician factors = 0; 5; 10; and infinity (= additive white Gaussian noise (AWGN) channel). The code polynomials in octal are (133; 145; 175). Here the union bounds are truncated at d max = 42. 4 The traditional bounds (7) get tighter for increasing values of and finally coincide with the modified bound for = 1 (AWGN channel) with which no av...
متن کاملA new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes
An upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes on the binary symmetr ic channel is derived. The bound is evaluated for rate 1 / 2 codes, and comparisons are made with simulations and with the bounds of Viterbi, Van de Meeberg, and Post. In particular, the new bound is significantly better than Van de Meeberg’s bound for ra...
متن کاملImproved upper bounds on the ML decoding error probability of parallel and serial concatenated turbo codes via their ensemble distance spectrum
The ensemble performance of parallel and serial concatenated turbo codes is considered, where the ensemble is generated by a uniform choice of the interleaver and of the component codes taken from the set of time varying recursive systematic convolutional codes. Following the derivation of the input-output weight enumeration functions of the ensembles of random parallel and serial concatenated ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 47 شماره
صفحات -
تاریخ انتشار 2001